package liu.first;

/**
 * 1、递归实现1,1,2,3,5,8,….第30个数是多少？
 * @author My
 *
 */
public class Array112358 {
	
	
		
		public static long Foo(int i){
			
			if(i<=0){
				return 1;
			}else if(i>0 &&i<=2 ){
				return 1;
			}else{
				return (long)Foo(i-1)+Foo(i-2);
			}
		} 
		
		public static void main(String[] args) {
			System.out.println(Foo(100));
		}

}
	
